Flow Enforcement Algorithms for ATM Networks

This paper characterizes four measurement algorithms for flow enforcement in ATM networks. The algorithms are the leaky bucket, the rectangular sliding window, the triangular sliding window, and the exponentially weighted moving average. A comparison, based partly on teletrafflc theory and partly on signal processing theory, is carried out. It is suggested to use the RMS measurement bandwidth to dimension linear algorithms for equal flow enforcement characteristics. Implementations are proposed on the block diagram level, and dimensioning examples are carried out when flow enforcing a renewaltype Connection using the four algorithms. The corresponding hardware demands are estimated and compared.